Adjoint sensitivity computations for an embedded-boundary Cartesian mesh method

نویسندگان

  • Marian Nemec
  • Michael J. Aftosmis
چکیده

1 Introduction Cartesian-mesh methods [I] are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast &id robust mesh generation for geometry of arbitrary cQing&eziQ:> but &o facili@$es _accezs to geoae&rj modelinp m d manipulation us in^ parametric Computer-Aided Design (CAD) tools. Our goal is to combine the automation capabilities of Cartesian methods with an eficient computation of' design sensitivities. five address this issue using the adjoint method, where the computational cost of the design sensitivities, or objective function gradients, is esseutially indepeudent of the iiunber of desi@ variables. In previous work [2, 31, we presented m accurate and efficient algorithm for the solution pf the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the dgoritlm included the computation of surface &ape sensitivities for triangulations based on puametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Central to this development is the computation of volume-mesh sensitivities to obtain a reliable turbation schemes com-due to non-smooth approximation to the ex method €or addressing the issues o the nwnn-ical method and results; 2 Problem Formulation The spatial discretization of the thee-dimensional Euler equations uses a second-order accurate fkite volume method with weak imposition of boundary conditions, resulting in a discrete system of equations WQ,M) = 0 (1) is t.he discrete solution vector for all N cells of a given mesh My and R is the flux residual vector. The iufluence of a shape design variablel X, on the residuals is implicit via the computational mesh M = f [ T (X) ] , where T denotes a surface triangulation of the CAD model. Hence, the gradient of a discrete objective function J (X , M , Q) is given by 2 M. Nemec and h4. J. Aftosmis where the vector .Ict represezlts adjoint variables given by the adjoint equation, for details see [3]. The focus of this work is on the emluation of the partial derivative terms A and B in Eq. 2, which represent the difffrentiation of the objective function and residual equations with respect to design variables that alter the surface …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method

We focus on the computation of objective function gradients using a discrete adjoint method for embedded-boundary Cartesian meshes. This is a significant step in our research toward using computer-aided design (CAD) directly for adjoint-based gradient computations. The approach treats the Cartesian mesh as a rigid structure. Under this assumption, accurate evaluation of mesh sensitivities depen...

متن کامل

Adjoint Algorithm for CAD-Based Shape Optimization Usign a Cartesian Method

We focus on the computation of objective function gradients using a discrete adjoint method for embedded-boundary Cartesian meshes. This is a significant step in our research toward using computer-aided design (CAD) directly for adjoint-based gradient computations. The approach treats the Cartesian mesh as a rigid structure. Under this assumption, accurate evaluation of mesh sensitivities depen...

متن کامل

Parallel Adjoint Framework for Aerodynamic Shape Optimization of Component-Based Geometry

We present a parallel adjoint framework for aerodynamic shape optimization problems using an embedded-boundary Cartesian mesh method. The design goals for the framework focus on an efficient and systematic integration of the underlying software modules. By linearizing the geometric constructors used in intersecting triangulated components, we develop a robust approach for computing surface shap...

متن کامل

Adjoint Formulation for an Embedded-Boundary Cartesian Method

A discrete-adjoint formulation is presented for the three-dimensional Euler equations discretized on a Cartesian mesh with embedded boundaries. The solution algorithm for the adjoint and flow-sensitivity equations leverages the Runge–Kutta time-marching scheme in conjunction with the parallel multigrid method of the flow solver. The matrix-vector products associated with the linearization of th...

متن کامل

An Embedded Cartesian Grid Euler Solver with Radial Basis Function for Boundary Condition Implementation

A Cartesian grid approach for the solution of the Euler equations within the framework of a patched, embedded Cartesian field mesh is described. As Cartesian grids are not necessarily body-aligned, an accurate representation for the surface boundary is important. In this paper a gridless boundary treatment using a cloud of nodes in the vicinity of the body combined with the multiquadric radial ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comput. Physics

دوره 227  شماره 

صفحات  -

تاریخ انتشار 2008